A mathematical framework for falsifiability
نویسندگان
چکیده
منابع مشابه
Practical Prediction of Inductive Generalization by the Method of Random Falsifiability
The relationship between learner capacity and generalization, established by Vapnik’s uniform convergence framework, suggests a remarkably simple validation procedure: reject the inductive hypothesis if the learning algorithm can also store the training examples with random labels. We study the properties of this apparently coarse estimator, which can be considered as the simplest possible capa...
متن کاملMaximal Falsifiability - Definitions, Algorithms, and Applications
Similarly to Maximum Satisfiability (MaxSAT), Minimum Satisfiability (MinSAT) is an optimization extension of the Boolean Satisfiability (SAT) decision problem. In recent years, both problems have been studied in terms of exact and approximation algorithms. In addition, the MaxSAT problem has been characterized in terms of Maximal Satisfiable Subsets (MSSes) and Minimal Correction Subsets (MCSe...
متن کاملA tentative taxonomy for predictive models in relation to their falsifiability.
The growing importance of predictive models in biomedical research raises some concerns on the correct methodological approach to the falsification of such models, as they are developed in interdisciplinary research contexts between physics, biology and medicine. In each of these research sectors, there are established methods to develop cause-effect explanations for observed phenomena, which c...
متن کاملA Philosophical Framework for Integrating Systems Pharmacology Models Into Pharmacometrics
The framework for systems pharmacology style models does not naturally sit with the usual scientific dogma of parsimony and falsifiability based on deductive reasoning. This does not invalidate the importance or need for overarching models based on pharmacology to describe and understand complicated biological systems. However, it does require some consideration on how systems pharmacology fits...
متن کاملTractable Falsifiability
We propose to strengthen Popper’s notion of falsifiability by adding the requirement that when an observation is inconsistent with a theory, there must be a “short proof” of this inconsistency. We model the concept of a short proof using tools from computational complexity, and provide some examples of economic theories that are falsifiable in the usual sense but not with this additional requir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016